On the linear programming bound for linear Lee codes

On the linear programming bound for linear Lee codes

Based on an invariance-type property of the Lee-compositions of a linear Lee code, additional equality constraints can be introduced to the linear programming problem of linear Lee codes. In this paper, we formulate this property in terms of an action of the multiplicative group of the field [Formula: see text] on the set of Lee-compositions. We show some useful properties of certain sums of Le...

On the Linear Programming Bound for Lee-codes

Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. In this paper, we study the linear programming bound for codes in the Lee metric. We introduce refinements on the linear programming bound for linear codes in the Lee metric, which give a tighter bound for linear codes. We also discuss the computational aspects of the problem and introduce...

on the effect of linear & non-linear texts on students comprehension and recalling

چکیده ندارد.

The Linear-Programming Bound

The Hamming Codes and Delsarte’s Linear Programming Bound